Complexity of computations
نویسندگان
چکیده
منابع مشابه
Energy complexity of optical computations
This paper provides lower bounds on the energy consumption and demonstrates an energy-time trade-off in optical computations. All the lower bounds are shown to have the matching upper bounds for a transitive function – shifting. Since the energy consumption in an optical transmission is a non-linear function of the distance, a new set of techniques was required to derive these lower bounds. We ...
متن کاملthe effect of task complexity on lexical complexity and grammatical accuracy of efl learners’ argumentative writing
بر اساس فرضیه شناخت رابینسون (2001 و 2003 و 2005) و مدل ظرفیت توجه محدود اسکهان (1998)، این تحقیق تاثیر پیچیدگی تکلیف را بر پیچیدگی واژگان و صحت گرامری نوشتار مباحثه ای 60 نفر از دانشجویان زبان انگلیسی بررسی کرد. میزان پیچیدگی تکلیف از طریق فاکتورهای پراکندگی-منابع تعیین شد. همه ی شرکت کنندگان به صورت نیمه تصادفی به یکی از سه گروه: (1) گروه موضوع، (2) گروه موضوع + اندیشه و (3) گروه موضوع + اندی...
15 صفحه اولLow complexity differential geometric computations
In this thesis, we consider the problem of fast and efficient indexing techniques for time sequences which evolve on manifold-valued spaces. Using manifolds is a convenient way to work with complex features that often do not live in Euclidean spaces. However, computing standard notions of geodesic distance, mean etc. can get very involved due to the underlying non-linearity associated with the ...
متن کاملComplexity of Computations with Matrices and Polynomials
We review the complexity of polynomial and matrix computations, as well as their various correlations to each other and some major techniques for the design of algebraic and numerical algorithms. Polynomial and matrix computations are highly important classical subjects. They have been thoroughly revised during the last decades due to the development of computer technology, whose latest notable...
متن کاملB74-1 Complexity of Computer Computations
131 W. E. Deskins, Abstract Algebra. London: Collier-Macmillan, 1964. [4] I. Flores, The Logic of Computer Arithmetic. Englewood Cliffs, N.J.: Prentice-Hall, 1963. 151 H. L. Garner, "The residue number system," IRE Trans. Electron. Comput., vol. EC-8, pp. 140-147, June 1959. 161 N. S. Szabo and R. 1. Tanaka, Residue Arithmetic and its Applications to Computer Technology. New York: McGraw-Hill, ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Communications of the ACM
سال: 1977
ISSN: 0001-0782,1557-7317
DOI: 10.1145/359810.359816